A survey on graphs which have equal domination and closed neighborhood packing numbers
نویسندگان
چکیده
Vizing’s conjecture on the Cartesian product G H of two graphs, γ(G H) ≥ γ(G)γ(H), will hold for all graphs G if the domination and (closed neighborhood) packing number of G are equal. By using the theory of integer programming, we state known sufficient conditions for when the packing number and the domination number of a graph are equal. We also give a sufficient condition using the theory of efficient domination. For regular graphs we find a necessary and sufficient condition for equlity to hold.
منابع مشابه
Packing and Domination Invariants on Cartesian Products and Direct Products
The dual notions of domination and packing in finite simple graphs were first extensively explored by Meir and Moon in [15]. Most of the lower bounds for the domination number of a nontrivial Cartesian product involve the 2-packing, or closed neighborhood packing, number of the factors. In addition, the domination number of any graph is at least as large as its 2-packing number, and the invaria...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملClosed neighborhood order dominating functions
The linear programmimg formulations of graph domination and graph packing are duals. Likewise, fractional efficient domination for a graph G has as its dual the parameter discussed in this paper, namely the minimum weight of a real-valued function f : V(G) -+ [0, (0) such that the sum of the weights in each closed neighborhood is at least its cardinality. The fractional and integer "closed neig...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کامل